Improved Approximation Bounds for Planar Point Pattern Matching
نویسندگان
چکیده
منابع مشابه
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R, and let ǫ ≥ 0 be a tolerance parameter, the problem is to find a rigid motion μ that maximizes the cardinality of subs...
متن کاملTitle : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING
Title : APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHING Minkyoung Cho, Doctor of Philosophy, 2010 Directed by: Professor David M. Mount Department of Computer Science Point pattern matching is a fundamental problem in computational geometry. For given a reference set and pattern set, the problem is to find a geometric transformation applied to the pattern set that minimizes so...
متن کاملImproved bounds for stochastic matching
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
متن کاملPoint Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform.We view a point set as a complete graph, establish the relation between the point set and the complete graph, and solve the point pattern matching problem by finding congruent complete graphs. Ex...
متن کاملApproximation Bounds For Minimum Degree Matching
We consider the MinGreedy strategy for Maximum Cardinality Matching. MinGreedy repeatedly selects an edge incident with a node of minimum degree. For graphs of degree at most ∆ we show that MinGreedy achieves approximation ratio at least ∆−1 2∆−3 in the worst case and that this performance is optimal among adaptive priority algorithms in the vertex model, which include many prominent greedy mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9059-9